On Graph Powers for Leaf-Labeled Trees
نویسندگان
چکیده
We extend the well-studied concept of a graph power to that of a k-leaf power G of a tree T : G is formed by creating a node for each leaf in the tree and an edge between a pair of nodes if and only if the associated leaves are connected by a path of length at most k. By discovering hidden combinatorial structure of cliques and neighborhoods, we have developed polynomial-time algorithms that, for k = 3 and k = 4, identify whether or not a given graph G is a k-leaf power of a tree T , and if so, produce a tree T for which G is a k-leaf power. We believe that our structural results will form the basis of a solution for more general k. The general problem of inferring hidden tree structure on the basis of leaf relationships shows up in several areas of application. 2002 Elsevier Science
منابع مشابه
Simplicial Powers of Graphs
In a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k ≥ 1, a graph G = (VG, EG) is the k-simplicial power of a graph H = (VH , EH) (H a root graph of G) if VG is the set of all simplicial vertices of H , and for all distinct vertices x and y in VG, xy ∈ EG if and only if the distance inH between x and y is atmost k. This concept generalizes k-leaf powers introduce...
متن کاملOn Leaf Powers
For an integer k, a tree T is a k-leaf root of a finite simple undirected graph G = (V,E) if the set of leaves of T is the vertex set V of G and for any two vertices x, y ∈ V , x 6= y, xy ∈ E if and only if the distance of x and y in T is at most k. Then graph G is a k-leaf power if it has a k-leaf root. G is a leaf power if it is a k-leaf power for some k. This notion was introduced and studie...
متن کاملStrictly chordal graphs are leaf powers
A fundamental problem in computational biology is the phylogeny reconstruction for a set of specific organisms. One of the graph theoretical approaches is to construct a similarity graph on the set of organisms where adjacency indicates evolutionary closeness, and then to reconstruct a phylogeny by computing a tree interconnecting the organisms such that leaves in the tree are labeled by the or...
متن کاملExtending the Tractability Border for Closest Leaf Powers
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most ` edge insertions or deletions such that it becomes a 4-leaf power. Herein, a 4-leaf power is a graph that can be constructed by considering an unrooted tree—the 4-leaf root—with leaves one-to-one labeled by the graph vertices, where we connect two graph vertices by an edge iff th...
متن کاملA forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
AgraphG is a k-leaf power if there is a tree T such that the vertices ofG are the leaves of T and two vertices are adjacent in G if and only if their distance in T is at most k. In this situation T is called a k-leaf root of G. Motivated by the search for underlying phylogenetic trees, the notion of a k-leaf power was introduced and studied by Nishimura, Ragde and Thilikos and subsequently in v...
متن کامل